package com.singzi.leetcode.N600;

public class T0553 {
}
class Solution0553 {
    public String optimalDivision(int[] nums) {
        String result = "";
        int n = nums.length;
        result = result + (char)nums[0] + "/" + "(";
        for(int i = 1;i < n-1; i++){
            result = result + String.valueOf(nums[i]) + "/";
        }
        result = result + (char)nums[n-1]+")";
        return  result;

    }
}